On Weighted Linear Least - Squares Problemsrelated to Interior

نویسنده

  • Anders FORSGREN
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of a Class of Preconditioners to Large Scale Linear Programming Problems

In most interior point methods for linear programming, a sequence of weighted linear least squares problems are solved, where the only changes from one iteration to the next are the weights and the right hand side. The weighted least squares problems are usually solved as weighted normal equations by the direct method of Cholesky factoriza-tion. In this paper, we consider solving the weighted n...

متن کامل

Iteratively reweighted least-squares implementation of the WLAV state-estimation method - Generation, Transmission and Distribution, IEE Proceedings-

An implementation of the weighted least absolute value (WLAV) method for obtaining an estimate of the state of the power system is presented. Most of the known WLAV methods use some form of linear programming software to find the best estimate. The paper shows that it is possible to obtain aWLAV estimate by simply applying the Newton-Raphson method to the set of equations that yield the critica...

متن کامل

On Weighted Linear Least-Squares Problems Related to Interior Methods for Convex Quadratic Programming

It is known that the norm of the solution to a weighted linear least-squares problem is uniformly bounded for the set of diagonally dominant symmetric positive definite weight matrices. This result is extended to weight matrices that are nonnegative linear combinations of symmetric positive semidefinite matrices. Further, results are given concerning the strong connection between the boundednes...

متن کامل

The Supremum and Stability of Weighted Pseudoinverses

During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O'Leary obtained an upper bound for scaled pseudoinverses sup W2P k(W 1 2 X) + W 1 2 k 2 of a matrix X where P is a set of diagonal positive deenite matrices. We improved their results to obtain the ...

متن کامل

Equivalent formulae for the supremum and stability of weighted pseudoinverses

During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O’Leary obtained an upper bound for scaled pseudoinverses sup W∈P ‖(W 12X)+W 2 ‖2 of a matrix X where P is a set of diagonal positive definite matrices. We improved their results to obtain the suprem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000